On nonlinear multi-covering problems

In this paper we define the exact k-coverage problem, and study it for the special cases of intervals and circular-arcs. Given a set system consisting of a ground set of n points with integer demands {d0, . . . , dn−1} and integer rewards, subsets of points, and an integer k, select up to k subsets such that the sum of rewards of the covered points is maximized, where point i is covered if exactly di subsets containing it are selected. Here we study this problem and some related optimization problems. We prove that the exact k-coverage problem with unbounded demands is NP-hard even for intervals on the real line and unit rewards. Our NP-hardness proof uses instances where some of the natural parameters of the problem are unbounded (each of these parameters is linear in the number of points). We show that this property is essential, as if we restrict (at least) one of these parameters to be a constant, then the problem is polynomial time solvable. Our polynomial time algorithms are given for various generalizations of the problem (in the setting where one of the parameters is a constant). B Mira Gonen [email protected]; [email protected] Reuven Cohen [email protected] Asaf Levin [email protected] Shmuel Onn [email protected] 1 Department of Mathematics, Bar-Ilan University, Ramat Gan 5290002, Israel 2 Department of Computer Science, Ariel University, Ariel 40700, Israel 3 Faculty of Industrial Engineering and Management, The Technion, Haifa 32000, Israel